Selecting Heavily Covered Points
نویسندگان
چکیده
منابع مشابه
Selecting Heavily Covered Points
A collection of geometric selection lemmas is proved, such as the following: For any set P of n points in three-dimensional space and any set ,9 of m spheres, where each sphere passes through a distinct point pair in P, there exists a point x, not necessarily in P, that is enclosed by f2 (m ! (n log )) of the spheres in S. Similar results apply in arbitrary fixed dimensions, and for geometric b...
متن کاملOn Gromov's Method of Selecting Heavily Covered Points
A result of Boros and Füredi (d = 2) and of Bárány (arbitrary d) asserts that for every d there exists cd > 0 such that for every n-point set P ⊂ R, some point of R is covered by at least cd ( n d+1 ) of the d-simplices spanned by the points of P . The largest possible value of cd has been the subject of ongoing research. Recently Gromov improved the existing lower bounds considerably by introd...
متن کاملA New Lower Bound Based on Gromov's Method of Selecting Heavily Covered Points
Boros and Füredi (for d = 2) and Bárány (for arbitrary d) proved that there exists a positive real number cd such that for every set P of n points in R d in general position, there exists a point of R contained in at least cd ( n d+1 ) d-simplices with vertices at the points of P . Gromov improved the known lower bound on cd by topological means. Using methods from extremal combinatorics, we im...
متن کاملTrust Management for Selecting Trustworthy Access Points
Both free and low-priced mobile wireless networks are expanding and its users are more numerous every day. This success is particularly due to the mobility offered to users. These networks have promoted and widespread the success and availability of mobile devices and their access technologies such as Wi-Fi, WiMAX and Bluetooth. Nevertheless, despite of their wide success, the problem is that t...
متن کاملSelecting Landmark Points for Sparse Manifold Learning
There has been a surge of interest in learning non-linear manifold models to approximate high-dimensional data. Both for computational complexity reasons and for generalization capability, sparsity is a desired feature in such models. This usually means dimensionality reduction, which naturally implies estimating the intrinsic dimension, but it can also mean selecting a subset of the data to us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1994
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539790179919